A new transformation method for nondominated coterie designSHOU, D; SHENG-DE WANG.Information sciences. 1993, Vol 74, Num 3, pp 223-246, issn 0020-0255Article

Complexité d'algorithmes et opérations sur les arbresDULUCQ, S; GIRE, S.Theoretical computer science. 1993, Vol 117, Num 1-2, pp 187-198, issn 0304-3975Conference Paper

Multi-microprocessorsSUNDARARAJAN, D; AHMAD, M. O; GANESAN, S et al.IEEE transactions on circuits and systems. 1985, Vol 32, Num 6, pp 620-622, issn 0098-4094Article

Un service de synchronisation distribuée tolérant les pannes: implantation dans CHORUS = A distributed and fault tolerant synchronization service: implementation in CHORUSEranian, Stéphane; Rifflet, J.-M.1995, 300 p.Thesis

An optimal algorithm for reducing edge-solvable mutual exclusion graphsKWOK-BUN YUE; JACOB, R. T.Computer journal (Print). 1994, Vol 37, Num 2, pp 129-138, issn 0010-4620Article

Modeling K-coteries by well-covered graphsYAMASHITA, M; KAMEDA, T. T.Networks (New York, NY). 1999, Vol 34, Num 3, pp 221-228, issn 0028-3045Article

Multiserialization of iterated transactionsFLE, M. P; ROUCAIROL, G.Information processing letters. 1984, Vol 18, Num 5, pp 243-247, issn 0020-0190Article

Another solution of the mutual exclusion problemKOWALTOWSKI, T; PALMA, A.Information processing letters. 1984, Vol 19, Num 3, pp 145-146, issn 0020-0190Article

Structured Deferral: Synchronization via ProcrastinationMCKENNEY, Paul E.Communications of the ACM. 2013, Vol 56, Num 7, pp 40-49, issn 0001-0782, 10 p.Article

Distributed mutual exclusion on a ring of processesMARTIN, A. J.Science of computer programming. 1985, Vol 5, Num 3, pp 265-276, issn 0167-6423Article

Enabling local actions by global consensusRAMAMRITHAM, K.Information systems (Oxford). 1985, Vol 10, Num 3, pp 319-324, issn 0306-4379Article

Fair mutual exclusion with unfair P and V operationsMARTIN, A. J; BURCH, J. R.Information processing letters. 1985, Vol 21, Num 2, pp 97-100, issn 0020-0190Article

The Balancing Act of Choosing Nonblocking FeaturesMICHAEL, Maged M.Communications of the ACM. 2013, Vol 56, Num 9, pp 46-53, issn 0001-0782, 8 p.Article

Correction et preuve partielle du protocole d'exclusion mutuelle de Galaxie = Correction and partial proof of Galaxy mutual exclusion protocolGROZ, Roland.1983, 34-3-6 pReport

A quorum based k-mutual exclusion by weighted k-quorum systemsFUJITA, S.Information processing letters. 1998, Vol 67, Num 4, pp 191-197, issn 0020-0190Article

Symmetric and economical solutions to the mutual exclusion problem in a distributed systemCOHEN, S; LEHMANN, D; PNUELI, A et al.Theoretical computer science. 1984, Vol 34, Num 1-2, pp 215-225, issn 0304-3975Conference Paper

When does a correct mutual exclusion algorithm guarantee mutual exclusion?LAMPORT, Leslie; PERL, Sharon; WEIHL, William et al.Information processing letters. 2000, Vol 76, Num 3, pp 131-134, issn 0020-0190Article

Synthèse des performances de 5 algorithmes distribués d'exclusion mutuelle = Performances synthesis of 5 mutal exclusion distributed algorithms1986, 223 p.Report

Transformational verification of parameterized protocols using array formulasPETTOROSSI, Alberto; PROIETTI, Maurizio; SENNI, Valerio et al.Lecture notes in computer science. 2006, pp 23-43, issn 0302-9743, isbn 3-540-32654-5, 1Vol, 21 p.Conference Paper

Bounding Lamport's Bakery algorithmJAYANTI, Prasad; KING TAN; FRIEDLAND, Gregory et al.Lecture notes in computer science. 2001, pp 261-270, issn 0302-9743, isbn 3-540-42912-3Conference Paper

A highly safe self-stabilizing mutual exclusion algorithmYEN, I.-L.Information processing letters. 1996, Vol 57, Num 6, pp 301-305, issn 0020-0190Article

A resilient token transfer algorithm for mutual exclusion in a distributed systemMURO, S; HASEGAWA, T; KATOH, N et al.Systems, computers, controls. 1985, Vol 16, Num 1, pp 1-8, issn 0096-8765Article

Speedup of Vidyasankar's algorithm for the group k-exclusion problemTAKAMURA, Masataka; ALTMAN, Tom; IGARASHI, Yoshihide et al.Information processing letters. 2004, Vol 91, Num 2, pp 85-91, issn 0020-0190, 7 p.Article

A highly concurrent group mutual l-exclusion algorithmVIDYASANKAR, K.Parallel processing letters. 2006, Vol 16, Num 4, pp 467-483, issn 0129-6264, 17 p.Article

Computing in totally anonymous asynchronous shared memory systemsATTIYA, Hagit; GORBACH, Alla; MORAN, Shlomo et al.Information and computation (Print). 2002, Vol 173, Num 2, pp 162-183, issn 0890-5401Article